Studies on Sizing

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lot-sizing on a tree

For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,SQ) inequalities can be simplified and extended. Finally some limited computational results are presented.

متن کامل

Simulation studies on router buffer sizing for short-lived and pacing TCP flows

Traditionally, the size of router buffers is determined by the bandwidth–delay product discipline (normal discipline), which is the product of the link bandwidth and average round-trip time (RTT) of flows passing through the router. However, recent research results have revealed that when the number of flows is sufficiently large, the buffer size can be decreased to the bandwidth–delay product ...

متن کامل

Population Sizing Based on Landscape Feature

Population size for EvolutionaryAlgorithms is usually an empirical parameter. We study the population size from aspects of fitness landscapes’ ruggedness and Probably Approximately Correct (PAC) learning theory.

متن کامل

Recent Results on Sizing Router Buffers

Today all Internet routers are built with buffers that hold packets in times of congestion. These buffers can typically store between 250ms to one second worth of data. According to a widely used “rule-of-thumb”, a link needs a buffer of size B = RTT × C, where RTT is the average round-trip time of a flow passing across the link, and C is the data rate of the link. For example, a 10Gb/s router ...

متن کامل

On the Wagner-Whitin Lot-Sizing Polyhedron

We study a family of unbounded polyhedra arising in the study of uncapacitated lot-sizing problems with Wagner-Whitin costs. With n the number of periods, we completely characterize the bounded faces of maximal dimension, and derive an O(n) algorithm to express any point within the polyhedron as a convex combination of extreme points and extreme rays. We also study adjacency on the polyhedra, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sen'i Gakkaishi

سال: 1950

ISSN: 0037-9875,1884-2259

DOI: 10.2115/fiber.6.319